Synchronous relaxation algorithm for parallel kinetic Monte Carlo simulations of thin film growth.
نویسندگان
چکیده
We present an optimistic synchronous relaxation algorithm for parallel kinetic Monte Carlo (KMC) simulations of thin film growth. This algorithm is based on spatial decomposition of the KMC lattice and it employs two measures aimed at improving the parallel efficiency: dynamic global updating and domain boundary shifting. We utilize this algorithm to simulate two different growth models, which represent the growth of Ag on Ag(111) and the heteroepitaxial growth of Ag on Pt(111). We show that these simulations can achieve good efficiency-especially for large domain sizes with a moderate number of processors. We find that domain boundary shifting can improve efficiency-especially for simulations of growth in the AgPt(111) system, where the potential-energy surface topology creates areas of rapid, localized motion. We analyze the origins of parallel efficiency in these simulations.
منابع مشابه
Semirigorous synchronous sublattice algorithm for parallel kinetic Monte Carlo simulations of thin film growth
The standard kinetic Monte Carlo algorithm is an extremely efficient method to carry out serial simulations of dynamical processes such as thin film growth. However, in some cases it is necessary to study systems over extended time and length scales, and therefore a parallel algorithm is desired. Here we describe an efficient, semirigorous synchronous sublattice algorithm for parallel kinetic M...
متن کاملHybrid asynchronous algorithm for parallel kinetic Monte Carlo simulations of thin film growth
We have generalized and implemented the hybrid asynchronous algorithm, originally proposed for parallel simulations of the spin-flip Ising model, in order to carry out parallel kinetic Monte Carlo (KMC) simulations. The parallel performance has been tested using a simple model of thin-film growth in both 1D and 2D. We also briefly describe how the data collection must be modified as compared to...
متن کاملRecent advances in parallel kinetic Monte Carlo: synchronous sublattice algorithm
Abstract. An efficient, semi-rigorous synchronous algorithm for parallel kinetic Monte Carlo simulations is presented. The accuracy and parallel efficiency are studied as a function of processor size, number of processors, and the ratio D/F of monomer hopping rate (D) to deposition rate (F ) for two different simple models of epitaxial growth. Since only local communication is required, the alg...
متن کاملReduction Strategies for Kinetic Monte Carlo Models of Thin Film Growth
Thin film deposition encompasses a variety of physical processes, which occur over a wide range of length and time scales. A major challenge in modeling and simulating thin film deposition is this disparity in scales. In this study we focus on an atomic-scale lattice model of surface processes. Kinetic Monte Carlo simulations provide stochastic realizations of the surface evolution, which may t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Physical review. E, Statistical, nonlinear, and soft matter physics
دوره 75 1 Pt 1 شماره
صفحات -
تاریخ انتشار 2007